Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times

Abstract We consider a number of parallel-machine scheduling problems in which jobs have variable processing times. The actual time each job is described by an arbitrary positive function the position it holds on machine. However, itself may additionally depend or machine this was assigned to. Our aim to find schedule that minimizes objectives maximum completion total time. present full set polynomial solutions for cases with no precedence constraints. also show case single-chained be not easier general, but some results can obtained, too.